The Extent of Constructive Game Labellings
نویسندگان
چکیده
We define a notion of combinatorial labellings, and show that ∆02 is the largest boldface pointclass in which every set admits a combinatorial labelling.
منابع مشابه
A constructive proof of Ky Fan's generalization of Tucker's lemma
We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of Sn that contain a flag of hemispheres. As a consequence, we produce a constructive proof of Tucker’s lemma that holds for a larger class of triangulations than previous constructive proofs.
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملRepresentation of Gender Roles in Child and Young Characters in Game of Thrones Series
he purpose of this study is to demonstrate how we, especially children and adolescents, are influenced by the media; this issue had investigated by analyzing the representation of gender roles in the Game of Thrones Series. There were based on three social learning, socialization and cultivation theories. This research had done a quantitative content analysis. The variables included 20 gender a...
متن کاملTowards an Argument Game for Stable Semantics
In this paper, we present a discussion game for argumentation under stable semantics. Our work is inspired by Vreeswijk and Prakken, who have defined a similar game for preferred semantics. In the current paper, we restate Vreeswijk and Prakken’s work using the approach of argument labellings and then show how it can be adjusted for stable semantics. The nature of the resulting argument game is...
متن کاملAn argument game for stable semantics
In this paper, we present a discussion game for argumentation under stable semantics. Our work is inspired by Vreeswijk and Prakken, who have defined a similar game for preferred semantics. In the current paper, we restate Vreeswijk and Prakken’s work using the approach of argument labellings and then show how it can be adjusted for stable semantics. The nature of the resulting argument game is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 17 شماره
صفحات -
تاریخ انتشار 2007